Controlled Fuzzy Parallel Rewriting
نویسنده
چکیده
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show that (i) regular control does not provide additional generating power to the model, (ii) the number of fuzzy substitutions in the underlying iteration grammar can be reduced to two, and (iii) the resulting family of fuzzy languages possesses strong closure properties, viz. it is a full hyper-AFFL, i.e., a hyper-algebraically closed full Abstract Family of Fuzzy Languages.
منابع مشابه
Fuzzy Graph Rewritings
This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...
متن کاملRewriting Fuzzy Graphs
This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy...
متن کاملReversibility in Parallel Rewriting Systems
This paper represents a study of reversibility in parallel rewriting systems over multisets. It emphasizes the controlled reversibility for a particular case of parallel rewriting systems given by membrane systems, a formalism inspired by the cell activity. We define reversible membrane systems in which the scenarios based on regular expressions are able to control the direction (forward or bac...
متن کاملA pragmatic approach to answering CQs over fuzzy DL-Lite-ontologies - introducing FLite
Fuzzy Description Logics (FDLs) generalize crisp ones by providing membership degree semantics. To offer efficient query answering for FDLs it is desirable to extend the rewriting-based approach for DL-Lite to its fuzzy variants. For answering conjunctive queries over fuzzy DL-LiteR ontologies we present an approach, that employs the crisp rewriting as a black-box procedure and treats the degre...
متن کاملConfluence and termination of fuzzy relations
Confluence and termination are essential properties connected to the idea of rewriting and substituting which appear in abstract rewriting systems. The aim of the present paper is to investigate confluence, termination, and related properties from the point of view of fuzzy logic leaving the ordinary notions a particular case when the underlying structure of truth degrees is two-valued Boolean ...
متن کامل